Strategy sets closed under payoff sampling

نویسندگان

چکیده

We consider population games played by procedurally rational players who, when revising their current strategy, test each of available strategies independently in a series random matches –i.e., battery tests–, and then choose the strategy that performed best this tests. This revision protocol leads to so-called payoff-sampling dynamics (aka test-all Best Experienced Payoff dynamics). In paper we characterize support all rest points these any game analyze asymptotic stability faces which they belong. do defining sets closed under payoff sampling, proving identification can be made terms simple comparisons between some payoffs game.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Binary random fields, random closed sets, and morphological sampling

We theoretically formulate the problem of processing continuous-space binary random fields by means of mathematical morphology. This may allow us to employ mathematical morphology to develop new statistical techniques for the analysis of binary random images. Since morphological transformations of continuous-space binary random fields are not measurable in general, we are naturally forced to em...

متن کامل

Minimal closed sets and maximal closed sets

Some properties of minimal open sets and maximal open sets are studied in [1, 2]. In this paper, we define dual concepts of them, namely, maximal closed set and minimal closed set. These four types of subsets appear in finite spaces, for example. More generally, minimal open sets and maximal closed sets appear in locally finite spaces such as the digital line. Minimal closed sets and maximal op...

متن کامل

Some Generalizations of Locally Closed Sets

Arenas et al. [1] introduced the notion of lambda-closed sets as a generalization of locally closed sets. In this paper, we introduce the notions of lambda-locally closed sets, Lambda_lambda-closed sets and lambda_g-closed sets and obtain some decompositions of closed sets and continuity in topological spaces.

متن کامل

Algorithms for Closed Under Rational Behavior (CURB) Sets

We provide a series of algorithms demonstrating that solutions according to the fundamental game-theoretic solution concept of closed under rational behavior (CURB) sets in two-player, normal-form games can be computed in polynomial time (we also discuss extensions to n-player games). First, we describe an algorithm that identifies all of a player’s best responses conditioned on the belief that...

متن کامل

Decomposing the real line into Borel sets closed under addition

We consider decompositions of the real line into pairwise disjoint Borel pieces so that each piece is closed under addition. How many pieces can there be? We prove among others that the number of pieces is either at most 3 or uncountable, and we show that it is undecidable in ZFC and even in the theory ZFC + c = ω2 if the number of pieces can be uncountable but less than the continuum. We also ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Games and Economic Behavior

سال: 2023

ISSN: ['0899-8256', '1090-2473']

DOI: https://doi.org/10.1016/j.geb.2022.12.006